package com.dyz.LeetCodeforSwordFingerOffer;



public class MirrorTree27 {
    //思路，深度遍历，递归
    public TreeNode mirrorTree(TreeNode root) {
        if(root==null){
            return null;
        }
        TreeNode left = mirrorTree(root.left);
        TreeNode right = mirrorTree(root.right);
        root.left = right;
        root.right = left;
        return root;
    }

}
